Quantifier elimination by dependency sequents
نویسندگان
چکیده
منابع مشابه
Checking Satisfiability by Dependency Sequents
We introduce a new algorithm for checking satisfiability based on a calculus of Dependency sequents (D-sequents). Given a CNF formula F (X), a D-sequent is a record stating that under a partial assignment a set of variables of X is redundant in formula ∃X[F ]. The Dsequent calculus is based on operation join that forms a new D-sequent from two existing ones. The new algorithm solves the quantif...
متن کاملDeciding Ellipticity by Quantifier Elimination
We show how ellipticity of partial differential systems in the sense of Douglis and Nirenberg can be decided algorithmically by quantifier elimination on real closed fields. A concrete implementation based on MuPAD and Redlog is presented.
متن کاملQuantifier Elimination
Quantifier elimination (QE) is a very powerful procedure for problems involving firstorder formulas over real fields. The cylindrical algebraic decomposition (CAD) is a technique for the “efficient” im plementation of QE, that effectively reduces an seemingly infinite problem into a finite (but potentially large) instance. For much more information about QE and CAD (including a reprint of Tar...
متن کاملNonlinear Control System Design by Quantifier Elimination
Many problems in control theory can be formulated as formulae in the first-order theory of real closed fields. In this paper we investigate some of the expressive power of this theory. We consider dynamical systems described by polynomial differential equations subjected to constraints on control and system variables and show how to formulate questions in the above framework which can be answer...
متن کاملSimulation and Optimization by Quantifier Elimination
We present a highly optimized method for the elimination of linear variables from a boolean combination of polynomial equations and inequalities. In contrast to the basic method described earlier, the practical applicability of the present method goes far beyond academic examples. The optimization is achieved by various strategies to prune superruous branches in the elimination tree constructed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2014
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-014-0214-z